منابع مشابه
Disjunctive Programs with Set Constraints
We study an extension of disjunctive logic programs called set constraint disjunctive (SCD) programs where the clauses of the program are allowed to have a disjunction of monotone set constraints in their head and arbitrary monotone and antimonotone set constraints in their body. We introduce new class of models called selector stable models which represent all models which can be computed by a...
متن کاملAbstract Disjunctive Answer Set Solvers
Disjunctive Answer Set Solvers Remi Brochenin1 and Yuliya Lierler2 and Marco Maratea3 Abstract. A fundamental task in answer set programming is to compute answer sets of logic programs. Answer set solvers are the programs that perform this task. The problem of deciding whether a disjunctive program has an answer set is Σ2 -complete. The high complexity of reasoning within disjunctive logic prog...
متن کاملOn the Linking Set Problem
We consider the Linking Set Problem which occurs as a subproblem in a decomposition procedure to solve large scale p-median problems such as the Optimal Diversity Management Problem. We show that a greedy algorithm solves the Linking Set Problem when the costs have a special structure. This special structure usually occurs when the Linking Set Problem arises from the decomposition of location p...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولThe maximum flow problem with disjunctive constraints
We study the maximum flow problem subject to binary disjunctive constraints in a directed graph: A negative disjunctive constraint states that a certain pair of arcs in a digraph cannot be simultaneously used for sending flow in a feasible solution. In contrast to this, positive disjunctive constraints force that for certain pairs of arcs at least one arc has to carry flow in a feasible solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00034-6